New lower bound for the number of critical periods for planar polynomial systems

نویسندگان

چکیده

In this paper, we construct two classes of planar polynomial Hamiltonian systems having a center at the origin, and obtain lower bounds for number critical periods these systems. For potential degree n, provide bound n?2 periods, acquire n2/2+n?5/2 when n is odd n2/2?2 even periods. To best our knowledge, are new, moreover latter one twice existing results up to dominant term.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The lower bound for the number of 1-factors in generalized Petersen graphs

‎In this paper‎, ‎we investigate the number of 1-factors of a‎ ‎generalized Petersen graph $P(N,k)$ and get a lower bound for the‎ ‎number of 1-factors of $P(N,k)$ as $k$ is odd‎, ‎which shows that the‎ ‎number of 1-factors of $P(N,k)$ is exponential in this case and‎ ‎confirms a conjecture due to Lovász and Plummer (Ann‎. ‎New York Acad‎. ‎Sci‎. ‎576(2006)‎, ‎no‎. ‎1‎, ‎389-398).

متن کامل

A Lower Bound for Periods of Matrices

For a nonsingular integer matrix A, we study the growth of the order of A modulo N . We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or all eigenvalues are powers of a single unit in a real quadratic field. For exceptional matrices, it is easily seen that there are arbitrarily large values o...

متن کامل

A new lower bound for the harmonious chromatic number

A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring. We obtain a new lower bound for the harmonious chromatic number of general graphs, in terms of the independence number of the graph, generalizing results of Moser [2].

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour

this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Differential Equations

سال: 2021

ISSN: ['1090-2732', '0022-0396']

DOI: https://doi.org/10.1016/j.jde.2020.08.036